Constraint Functional
نویسندگان
چکیده
In this paper, we present the framework of constraint functional programming (CFP) for constructing constraint systems over functional programs. The idea is that functional programs can be used in a multiple way either to evaluate expressions or to solve constraints. The ability to solve constraints provides CFP with the novel feature of computing queries over functional programs. A constraint solver for solving CFP constraints is proposed in this paper based on the integration of the underlying constraint solvers with a complete and optimal narrowing algorithm which computes non-ground expressions.
منابع مشابه
The Effect of Modified Constraint Induced Movement Therapy on Upper Extremity Function In a Patient Suffering From Chronic Severe Acquired Brain Injury: A Case Study
Objective: The primary objective of this case study was to investigate the effect of modified constraint-induced movement therapy on upper extremity function in a patient with severe acquired brain injury after 4 years. Material & method: A 33 years old women (F.Z), who had a severe acquired brain injury (ABI) 4 years ago participated in the present study. The right hand was the dominan...
متن کاملFree and constrained equilibrium states in a variational problem on a surface
We study the equilibrium states for an energy functional with a parametric force field on a region of a surface. Consideration of free equilibrium states is based on Lyusternik - Schnirelman's and Skrypnik's variational methods. Consideration of equilibrium states under a constraint of geometrical character is based on an analog of Skrypnik's method, described in [P. Vyridis, {it Bifurcation in...
متن کاملLogistica-cfp: an Implementation of Constraint Functional Programming
As an alternative to constraint logic programming (CLP), LOGISTICA-CFP implements constraint functional programming (CFP) by borrowing from the approach of SCREAMER and building on the nondeterministic functional programming language LOGISTICA. Although currently in the experimental stages, LOGISTICA-CFP demonstrates that a functional approach can be used to implement constraint programming in ...
متن کاملAn Elimination Algorithm for Functional Constraints
Functional constraints are studied in Constraint Satisfaction Problems (CSP) using consistency concepts (e.g., [4, 1]). In this paper, we propose a new method — variable substitution — to process functional constraints. The idea is that if a constraint is functional on a variable, this variable in another constraint can be substituted using the functional constraint without losing any solution....
متن کاملIncreasing Functional Constraints Need to Be Checked Only Once
Central to solving Constraint Satisfaction Problem (CSP) is the problem of consistency check. Past research has produced many general and specific consistency algorithms. Specific algorithms are efficient specializations of the general ones for specific constraints. Functional, anti-functional and monotonic constraints are three important classes of specific constraints. They form the basis of ...
متن کامل